Testing Tournaments
نویسنده
چکیده
منابع مشابه
Potential, Prizes and Performance: Testing Tournament Theory with Professional Tennis Data
Potential, Prizes and Performance: Testing Tournament Theory with Professional Tennis Data This paper tests two hypotheses from the theory of elimination tournaments: (i) that uneven tournaments, where the contestants are ex ante heterogeneous, entail lower effort exertion; this is a prediction from agency theory that has not been tested empirically before; and (ii) whether incentives set throu...
متن کاملThe Complexity of Kings
A king in a directed graph is a node from which each node in the graph can be reached via paths of length at most two. There is a broad literature on tournaments (completely oriented digraphs), and it has been known for more than half a century that all tournaments have at least one king [Lan53]. Recently, kings have proven useful in theoretical computer science, in particular in the study of t...
متن کاملt-Pancyclic Arcs in Tournaments
Let $T$ be a non-trivial tournament. An arc is emph{$t$-pancyclic} in $T$, if it is contained in a cycle of length $ell$ for every $tleq ell leq |V(T)|$. Let $p^t(T)$ denote the number of $t$-pancyclic arcs in $T$ and $h^t(T)$ the maximum number of $t$-pancyclic arcs contained in the same Hamiltonian cycle of $T$. Moon ({em J. Combin. Inform. System Sci.}, {bf 19} (1994), 207-214) showed that $...
متن کاملHow (not) to Incent Crowd Workers
Crowdsourcing gains momentum: In digital work places such as Amazon Mechanical Turk, oDesk, Clickworker, 99designs, or InnoCentive it is easy to distribute human work to hundreds or thousands of freelancers. In these crowdsourcing settings, one challenge is to properly incent worker effort to create value. Common incentive schemes are piece rate payments and rankorder tournaments among workers....
متن کاملA Further Step Towards an Understanding of the Tournament Equilibrium Set
We study some problems pertaining to the tournament equilibrium set (τ for short). A tournament H is a τ-retentive tournament if there is a tournament T which has a minimal τ-retentive set R such that T [R] is isomorphic to H. We study τ-retentive tournaments and achieve many significant results. In particular, we prove that there are no τretentive tournaments of size 4, only 2 non-isomorphic τ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001